Multitasking scheduling with batch distribution and due date assignment

Batch scheduling problem with due-date and fuzzy precedence relation

Due-date assignment and parallel-machine scheduling with deteriorating jobs

In this paper we study the problem of scheduling n deteriorating jobs on m identical parallel machines. Each job’s processing time is a nondecreasing function of its start time. The problem is to determine an optimal combination of the due-date and schedule so as to minimize the sum of the due-date, earliness and tardiness penalties. We show that this problem is NP-hard, and we present a heuris...

Batch Scheduling and Common Due Date Assignment Problem: an NP-hard Case

An important special case of the problem studied in Cheng and Kovalyov (1996) arises when there are equal setup times and equal job processing times. Computational complexity of this case was indicated to be open, however. I prove its NP-hardness. Cheng and Kovalyov [l] introduced the following due date assignment and scheduling problem. There are n groups of jobs to be scheduled for processing...

Batch Scheduling and Common Due-date Assignment on a Single Machine

We consider the problem of scheduling n groups of jobs on a single machine where three types of decisions are combined: scheduling, batching and due-date assignment. Each group includes identical jobs and may be split into batches; jobs within each batch are processed jointly. A sequence independent machine set-up time is needed between each two consecutively scheduled batches of different grou...

Due-date assignment and maintenance activity scheduling problem

In the scheduling problem addressed in this note we have to determine: (i) the job sequence, (ii) the (common) due-date, and (iii) the location of a rate modifying (maintenance) activity. Jobs scheduled before (after) the due-date are penalized according to their earliness (tardiness) value. The processing time of a job scheduled after the maintenance activity decreases by a job-dependent facto...